The crossing number of the circular graph C(2m+2, m)
نویسندگان
چکیده
The circular graph C(n, m) is such a graph that whose vertex set is {v0, v1, v2, · · · , vn−1} and edge set is {vivi+1, vivi+m | i = 0, 1, · · · , n − 1}, where m,n are natural numbers, addition is modulo n, and 2 ≤ m ≤ b2 c. This paper shows the crossing number of the circular graph C(2m + 2,m)(m ≥ 3) is m + 1.
منابع مشابه
On the Volume of µ-way G-trade
A $ mu $-way $ G $-trade ($ mu geq 2) $ consists of $ mu $ disjoint decompositions of some simple (underlying) graph $ H $ into copies of a graph $ G. $ The number of copies of the graph $ G $ in each of the decompositions is the volume of the $ G $-trade and denoted by $ s. $ In this paper, we determine all values $ s $ for which there exists a $ mu $-way $ K_{1,m} $-trade of vo...
متن کاملOn net-Laplacian Energy of Signed Graphs
A signed graph is a graph where the edges are assigned either positive ornegative signs. Net degree of a signed graph is the dierence between the number ofpositive and negative edges incident with a vertex. It is said to be net-regular if all itsvertices have the same net-degree. Laplacian energy of a signed graph is defined asε(L(Σ)) =|γ_1-(2m)/n|+...+|γ_n-(2m)/n| where γ_1,...,γ_n are the ei...
متن کاملAn Improved Neural Network Model for the 2-page Crossing Number Problem
The simplest graph drawing method is that of putting the vertices of a graph on a line and drawing the edges as half-circles either above or below the line. Such drawings are called 2-page book drawings. The smallest number of crossings over all 2-page drawings of a graph G is called the 2-page crossing number of G. Cimikowski and Shope have solved the 2-page crossing number problem for an n-ve...
متن کاملThe Bundled Crossing Number
We study the algorithmic aspect of edge bundling. A bundled crossing in a drawing of a graph is a group of crossings between two sets of parallel edges. The bundled crossing number is the minimum number of bundled crossings that group all crossings in a drawing of the graph. We show that the bundled crossing number is closely related to the orientable genus of the graph. If multiple crossings a...
متن کاملNumber of Crossing-Free Geometric Graphs vs. Triangulations
We show that there is a constant α > 0 such that, for any set P of n ≥ 5 points in general position in the plane, a crossing-free geometric graph on P that is chosen uniformly at random contains, in expectation, at least (12 + α)M edges, where M denotes the number of edges in any triangulation of P . From this we derive (to our knowledge) the first non-trivial upper bound of the form cn · tr(P ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 304 شماره
صفحات -
تاریخ انتشار 2005